Micro-local Analysis for the Metropolis Algorithm
نویسندگان
چکیده
Abstract We prove sharp rates of convergence to stationarity for a simple case of the Metropolis algorithm: the placement of a single disc of radius h randomly into the interval [−1 − h, 1 + h], with h > 0 small. We find good approximations for the top eigenvalues and eigenvectors. The analysis gives rigorous proof for the careful numerical work in ([DN04]). The micro-local techniques employed offer promise for the analysis of more realistic problems.
منابع مشابه
Bayesian Logistic Regression Model Choice via Laplace-Metropolis Algorithm
Following a Bayesian statistical inference paradigm, we provide an alternative methodology for analyzing a multivariate logistic regression. We use a multivariate normal prior in the Bayesian analysis. We present a unique Bayes estimator associated with a prior which is admissible. The Bayes estimators of the coefficients of the model are obtained via MCMC methods. The proposed procedure...
متن کاملOptimizing Design of Stand-alone Hybrid Solar Micro-CHP Systems Using LUS Based Particle Swarm Optimization Algorithm
Utilizing the combined cooling, heating and power generation (CHP) systems to produce cooling, heat and electricity is growing rapidly due to their high efficiency and low emissions in commercial and industrial applications. In conventional CHP systems the deficit of the system power can be purchased from the grid. However, this system cannot be used as the standalone application. The hybrid so...
متن کاملM ar 2 00 6 Local and cluster critical dynamics of the 3 d random - site Ising model
We present the results of Monte Carlo simulations for the critical dynamics of the three-dimensional site-diluted quenched Ising model. Three different dynamics are considered, these correspond to the local update Metropolis scheme as well as to the Swendsen-Wang and Wolff cluster algorithms. The lattice sizes of L = 10 − 96 are analysed by a finite-size-scaling technique. The site dilution con...
متن کاملOPTIMAL SCALINGS FOR LOCAL METROPOLIS–HASTINGS CHAINS ON NONPRODUCT TARGETS IN HIGH DIMENSIONS By Alexandros Beskos,
We investigate local MCMC algorithms, namely the random-walk Metropolis and the Langevin algorithms, and identify the optimal choice of the local step-size as a function of the dimension n of the state space, asymptotically as n→∞. We consider target distributions defined as a change of measure from a product law. Such structures arise, for instance, in inverse problems or Bayesian contexts whe...
متن کاملComparison of Acceptance Criteria in Randomized Local Searches
One key component of stochastic local search algorithms is the acceptance criterion that determines whether a solution is accepted as the new current solution or it is discarded. One of the most studied local search algorithms is simulated annealing. It often uses the Metropolis condition as acceptance criterion, which always accepts equal or better quality solutions and worse ones with a proba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007